Binary and Ternary Aggregation within Tethered Protein Constructs
نویسندگان
چکیده
منابع مشابه
Extending Aggregation Constructs in UML
In this paper we provide a characterization of aggregation as used in static conceptual modeling of applications. Based on this characterization we suggest changes to UML notation that allow for more precise characterization of aggregate structures.
متن کاملBinary/ternary extreme learning machines
In this paper, a new hidden layer construction method for Extreme Learning Machines (ELMs) is investigated, aimed at generating a diverse set of weights. The paper proposes two new ELM variants: Binary ELM, with a weight initialization scheme based on f0;1g–weights; and Ternary ELM, with a weight initialization scheme based on f 1;0;1g–weights. The motivation behind this approach is that these ...
متن کاملNew binary and ternary LCD codes
LCD codes are linear codes with important cryptographic applications. Recently, a method has been presented to transform any linear code into an LCD code with the same parameters when it is supported on a finite field with cardinality larger than 3. Hence, the study of LCD codes is mainly open for binary and ternary fields. Subfield-subcodes of $J$-affine variety codes are a generalization of B...
متن کاملBinary and Ternary Codes of Hadamard Matrices∗
Let H be a Hadamard matrix of order 24. In this note, we show that the extremality of the binary code of H is equivalent to the extremality of the ternary code of HT . This fact has been observed by Assmus and Key [1], as a result of the complete classification of Hadamard matrices of order 24. Our proof is a consequence of more general results on the minimum weight of the dual code of the code...
متن کاملPrefix transpositions on binary and ternary strings
The problem of Sorting by Prefix Transpositions asks for the minimum number of prefix transpositions required to sort the elements of a given permutation. In this paper, we study a variant of this problem where the prefix transpositions act not on permutations but on strings over an alphabet of fixed size. Here, we determine the minimum number of prefix transpositions required to sort the binar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Biophysical Journal
سال: 2006
ISSN: 0006-3495
DOI: 10.1529/biophysj.105.075846